A problem of Diophantus and Dickson’s conjecture
نویسنده
چکیده
A Diophantine m-tuple with the property D(n), where n is an integer, is defined as a set of m positive integers with the property that the product of its any two distinct elements increased by n is a perfect square. It is known that if n is of the form 4k + 2, then there does not exist a Diophantine quadruple with the property D(n). The author has formerly proved that if n is not of the form 4k + 2 and n 6∈ {−15,−12,−7,−4,−3,−1, 3, 5, 7, 8, 12, 13, 15, 20, 21, 24, 28, 32, 48, 60, 84}, then there exist at least two distinct Diophantine quadruples with the property D(n). The main problem of this paper is to consider the set U of all integers n, not of the form 4k + 2, such that there exist at most two distinct Diophantine quadruples with the property D(n). One open question is whether the set U is finite or not. It can be proved that if n ∈ U and |n| > 48, then n can be represented in one of the following forms: 4k + 3, 16k + 12, 8k + 5, 32k + 20. The main results of the this paper are: If n ∈ U \ {−9,−1, 3, 7, 11} and n ≡ 3 (mod 4), then the integers |n− 1|/2, |n− 9|/2 and |9n− 1|/2 are primes, and either |n| is prime or n is the product of twin primes. If n ∈ U \ {−27,−3, 5, 13, 21, 45} and n ≡ 5 (mod 8), then the integers |n|, |n− 1|/4, |n− 9|/4 and |9n− 1|/4 are primes. 1991 Mathematics Subject Classification: 11D09, 11A41
منابع مشابه
Notes on Dickson’s Conjecture
In 1904, Dickson [5] stated a very important conjecture. Now people call it Dickson’s conjecture. In 1958, Schinzel and Sierpinski [14] generalized Dickson’s conjecture to the higher order integral polynomial case. However, they did not generalize Dickson’s conjecture to the multivariable case. In 2006, Green and Tao [13] considered Dickson’s conjecture in the multivariable case and gave direct...
متن کاملSublattices of Finite Index
Assuming the Gowers Inverse conjecture and the Möbius conjecture for the finite parameter s, Green-Tao verified Dickson’s conjecture for lattices which are ranges of linear maps of complexity at most s. In this paper, we reformulate GreenTao’s theorem on Dickson’s conjecture, and prove that, if L is the range of a linear map of complexity s, and L1 is a sublattice of L of finite index, then L1 ...
متن کاملPrime Points in the Intersection of Two Sublattices
Let Ψ : Z → Z be an affine-linear map, and Ψ̇ be its linear part. A famous and difficult open conjecture of Dickson predicts the distribution of prime points in the affine sublattice Ψ(Z) of Z. Assuming the Gowers Inverse conjecture GI(s) and the Möbius and nilsequences conjecture MN(s) for some finite s > 1, GreenTao [GT3] verified Dickson’s conjecture for Ψ of complexity s. Let Φ : Z → Z be an...
متن کاملREVIEWS AND DESCRIPTIONS OF TABLES AND BOOKS The numbers in brackets are assigned according to the American Mathematical Society classification scheme accessible from www.ams.org/msc/. 1[11N35, 11N36, 11N32]—A higher-dimensional sieve method with procedures
The Twin Prime Conjecture is a difficult unsolved problem in number theory; it states that there are infinitely many primes p such that p+2 is also prime. This is a special case of a more general statement known as Dickson’s Conjecture, which is that if h1, h2, . . . , hk are distinct integers satisfying some obviously necessary conditons, then there are infinitely many natural numbers n such that
متن کاملComplete Solution of the Polynomial Version of a Problem of Diophantus
In this paper, we prove that if {a, b, c, d} is a set of four non-zero polynomials with integer coefficients, not all constant, such that the product of any two of its distinct elements plus 1 is a square of a polynomial with integer coefficients, then (a + b − c − d) = 4(ab + 1)(cd + 1). This settles the “strong” Diophantine quintuple conjecture for polynomials with integer coefficients.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005